Slides for Definability and Computability, 236331 (2001)
-
Lecture 1:
Prelude, Outlook and References
-
Lecture 2:
Definability in First and Second Order Logic
-
Lecture 3:
Non-definability in First Order and Monadic Second Order Logic, I
Ehrenfeucht-Fraisse-Games
-
Lecture 4:
Non-definability in First Order and Monadic Second Order Logic, II
Hintikka Formulas
-
Lecture 5:
Finite Automata and Regular Languages
-
Lecture 6:
The Complexity of Model Checking
-
Lecture 7:
Translation Schemes
-
Lecture 8-9:
Decidable and Undecidable Theories
-
Lecture 10:
Algorithmic Uses
of the
Feferman-Vaught Theorem